Kit of Uniformly Deployed Sets for p-Location Problems

This paper deals with p-location problem solving processes based on a decomposition, which separates the creation of uniformly deployed set problems from solution for that specific instance. The research presented in this is focused methods construction sets solutions and examination their impact efficiency subsequent optimization algorithms. approaches to are used constitution predetermined families solutions, have standard sizes. We introduce two construction: first one composition, followed by an enlargement process; second makes use voltage graphs. completed algorithm, adjusts sizes solved influence approach process studied real-world benchmarks, include both p-median objective function generalized disutility function. performed alternatively using swap or path-relinking methods. Results computational study obtained all combinations mentioned evaluated concluding part make characteristics visible.